منابع مشابه
Spectral triples of weighted groups
We study spectral triples on (weighted) groups and consider functors between the categories of weighted groups and spectral triples. We study the properties of weights and the corresponding functor for spectral triples coming from discrete weighted groups.
متن کاملThe covering number of M 24
A finite cover C of a group G is a finite collection of proper subgroups of G such that G is equal to the union of all of the members of C. Such a cover is called minimal if it has the smallest cardinality among all finite covers of G. The covering number of G, denoted by σ(G), is the number of subgroups in a minimal cover of G. In this paper the covering number of the Mathieu group M24 is show...
متن کاملComputing Szeged index of graphs on triples
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define t...
متن کاملOn the irreducible characters of Camina triples
The Camina triple condition is a generalization of the Camina condition in the theory of finite groups. The irreducible characters of Camina triples have been verified in the some special cases. In this paper, we consider a Camina triple (G,M,N) and determine the irreducible characters of G in terms of the irreducible characters of M and G/N.
متن کاملPythagorean Triples
The name comes from elementary geometry: if a right triangle has leg lengths x and y and hypotenuse length z, then x + y = z. Of course here x, y, z are positive real numbers. For most integer values of x and y, the integer x + y will not be a perfect square, so the positive real number √ x2 + y2 will be irrational: e.g. x = y = 1 =⇒ z = √ 2. However, a few integer solutions to x + y = z are fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2018
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-018-1961-1